Some results on 2-homogeneous graphs
نویسندگان
چکیده
We consider 2-homogeneous graphs, introduced by Nomura [J. Combin. Theory ser. B 60 (1994)], and discuss the elementary properties. Moreover, the diameter of 2-homogeneous graphs with even girth is bounded, and some restrictions of 2-homogeneous graphs with odd girth are obtained.
منابع مشابه
Metrically Homogeneous Graphs Ii (notes)
We continue the analysis of metrically homogeneous graphs, taking up where the catalog left off. We give some general results on the structure of Γi, and show that the metrically homogeneous graphs of diameter 3 are all in the catalog.
متن کاملMetrically Homogeneous Graphs
We give a catalog of the known metrically homogeneous graphs, and with proofs of existence, mainly via Fraıssé theory. We also give some classification results.
متن کاملSome results on vertex-edge Wiener polynomials and indices of graphs
The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...
متن کاملFurther Results on Betweenness Centrality of Graphs
Betweenness centrality is a distance-based invariant of graphs. In this paper, we use lexicographic product to compute betweenness centrality of some important classes of graphs. Finally, we pose some open problems related to this topic.
متن کاملA Universal Structure for Jv-free Graphs
Countable homogeneous graphs have been classified by Alistair Lachlan and Robert Woodrow [5,11]. There is a countable bipartite graph called the universal 'homogeneous' bipartite graph. However, this graph does not occur in Lachlan and Woodrow's list, because it is not homogeneous as a graph but only as a graph with a fixed bipartition (Cameron [1]). In this paper, I describe a graph which is a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 27 شماره
صفحات -
تاریخ انتشار 2003